Graph Layouts by t-SNE
نویسندگان
چکیده
We propose a new graph layout method based on a modification of the t-distributed Stochastic Neighbor Embedding (t-SNE) dimensionality reduction technique. Although t-SNE is one of the best techniques for visualizing high-dimensional data as 2D scatterplots, t-SNE has not been used in the context of classical graph layout. We propose a new graph layout method, tsNET, based on representing a graph with a distance matrix, which together with a modified t-SNE cost function results in desirable layouts. We evaluate our method by a formal comparison with state-of-the-art methods, both visually and via established quality metrics on a comprehensive benchmark, containing real-world and synthetic graphs. As evidenced by the quality metrics and visual inspection, tsNET produces excellent layouts.
منابع مشابه
Optimization Equivalence of Divergences Improves Neighbor Embedding
Visualization methods that arrange data objects in 2D or 3D layouts have followed two main schools, methods oriented for graph layout and methods oriented for vectorial embedding. We show the two previously separate approaches are tied by an optimization equivalence, making it possible to relate methods from the two approaches and to build new methods that take the best of both worlds. In detai...
متن کاملVisualizing Large-scale and High-dimensional Data
We study the problem of visualizing large-scale and highdimensional data in a low-dimensional (typically 2D or 3D) space. Much success has been reported recently by techniques that first compute a similarity structure of the data points and then project them into a low-dimensional space with the structure preserved. These two steps suffer from considerable computational costs, preventing the st...
متن کاملEffects of sparseness and randomness of pairwise distance matrix on t-SNE results
Abstract. We apply ideas from random graph theory to sparse pairwise distance matrices in dimension reduction. We use matrices with some short and some randomly chosen distances, and study effects of matrix sparseness and randomness on trustworthiness and continuity of t-SNE visualizations. The existing works have either concentrated on matrices with only short distances, or implemented heurist...
متن کاملThe Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems
The logic engine technique has been used in the past to establish the NP-hardness of a number of graph representations. The original technique can only be applied in those situations in which subgraphs exist for which the only possible layouts are rigid. In this paper we introduce an extension called the wobbly logic engine which can be used to prove the NP-hardness of several graph representat...
متن کاملExpansion of layouts of complete binary trees into grids
Let Th be the complete binary tree of height h. Let M be the infinite grid graph with vertexset Z, where two vertices (x1,y1) and (x2,y2) of M are adjacent if and only if|x1-x2| + |y1-y2| = 1. Suppose that T is a tree which is a subdivision of Th and is also isomorphicto a subgraph of M. Motivated by issues in optimal VLSI design, we show that the point expansionration(T)<lb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 36 شماره
صفحات -
تاریخ انتشار 2017